package leecode

import "sort"

func merge88(nums1 []int, m int, nums2 []int, n int) {
	index := 0
	for i := m; i < len(nums1); i++ {
		nums1[i] = nums2[index]
		index++
	}
	sort.Ints(nums1)
}
